/**
*      author: Y_Yao
*      created: 2024-10-28 18:16:50
**/

#include<bits/stdc++.h>

using namespace std;
#define int LL
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2000 + 7;
int a[N],dp[N];
int n;

void solve()
{


    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    int ret = LLINF;
    for(int i = 1;i <= n;i++)
    {
        int count = 0;
        for(int j = i + 1;j <= n;j++)
        {
            if(a[j] > a[i]) count++;
        }
        count += i - 1;
        ret = min(count,ret);
    }
    cout << ret << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}